An Automatic Well Planner for Complex Well Trajectories

نویسندگان

چکیده

Abstract A data-driven automatic well planner procedure is implemented to develop complex trajectories by efficiently adapting near-well reservoir properties and geometry. The draws inspiration from geosteering drilling operations, where modern logging-while-drilling tools enable the adjustment of during drilling. Analogously, proposed develops based on a selected geology-based fitness measure using an artificial neural network as decision maker in virtual sequential process within model. While networks have seen extensive use other areas management, best our knowledge, this work first apply trajectory design models. Importantly, both input data generation used train actual operations conducted trained are efficient calculations, since these rely solely geometric initial reservoir, thus do not require additional simulations. Therefore, main advantage over traditional methods highly articulated adapted low-order representation. Well generated realistic qualitatively quantitatively compared differential evolution algorithm. Results show that resulting improve productivity straight line trajectories, for channelized geometrically reservoirs. Moreover, overall with comparable solutions obtained evolution, but at much lower computational cost.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic approaches for seismic to well tying

Tying the synthetic trace to the actual seismic trace at the well location is a labor-intensive task that relies on the interpreter’s experience and the similarity metric used. The traditional seismic to well tie suffers from subjectivity by visually matching major events and using global crosscorrelation to measure the quality of that tying. We compared two automatic techniques that will decre...

متن کامل

Tree-Automatic Well-Founded Trees

We investigate tree-automatic well-founded trees. Using Delhommé’s decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-founded tree is strictly below ω. Moreover, we make a step towards proving that the ranks of tree-automatic well-founded partial orders are bounded by ω ω : we prove this bound for what we call upwards linear partial o...

متن کامل

Well, well, well water.

Although the multiplication of bacteriophages (phages) has a substantial impact on the biosphere, comparatively little is known about how the external environment affects phage production. Here we report that sub-lethal concentrations of certain antibiotics can substantially stimulate the host bacterial cell’s production of some virulent phage. For example, a low dosage of cefotaxime, a cephalo...

متن کامل

Automatic Symmetry Detection in Well-Formed Nets

Formal verification of complex systems using high-level Petri Nets faces the so-called state-space explosion problem. In the context of Petri nets generated from a higher level specification, this problem is particularly acute due to the inherent size of the considered models. A solution is to perform a symbolic analysis of the reachability graph, which exploits the symmetry of a model. Well-Fo...

متن کامل

Automatic Finite Unfolding Using Well-Founded Measures

t> We elaborate on earlier work proposing general criteria to control unfolding during partial deduction of logic programs. We study several techniques relying on more general and more powerful well-founded orderings. In particular, we extend our framework to incorporate lexicographical priorities between argument positions in a goal. We show that this handles some remaining deficiencies in pre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Geosciences

سال: 2021

ISSN: ['1874-8961', '1874-8953']

DOI: https://doi.org/10.1007/s11004-021-09953-x